Drawing High-degree Graphs with Small Grid-size Drawing High-degree Graphs with Small Grid-size

In this paper, we present a general scheme to produce interactive and static orthogonal drawings of graphs. As opposed to most known algorithms, we do not restrict ourselves to graph with maximum degree 4, but allow arbitrary degrees. We show here how, with one speciic implementation of the scheme, we can obtain an m+n 2 m+n 2-grid for all simple connected graphs without nodes of degree 1. Furthermore, there is at most one bend per edge, and the number of bends is at most m. Th dimension of node v is at most deg (v) 2. The algorithm works in linear time.